Integer-Magic Spectra of Trees of Diameter Five

Integer-Magic Spectra of Trees with Diameters at most Four

For any k ∈ N, a graph G = (V,E) is said to be Zk-magic if there exists a labeling l : E(G) −→ Zk − {0} such that the induced vertex set labeling l : V (G) −→ Zk defined by l(v) = ∑ u∈N(v) l(uv) is a constant map. For a given graph G, the set of all k ∈ Z+ for which G is Zk-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper we will consider trees whose diamet...

INTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS

For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...

The integer-magic spectra and null sets of the Cartesian product of trees

Estimating Height and Diameter Growth of Some Street Trees in Urban Green Spaces

Estimating urban trees growth, especially tree height is very important in urban landscape management. The aim of the study was to predict of tree height base on tree diameter. To achieve this goal, 921 trees from five species were measured in five areas of Mashhad city in 2014. The evaluated trees were ash tree (Fraxinus species), plane tree (Platanus hybrida), white mulberry (Morus alba), ail...

On Integer-magic Spectra of Caterpillars

For any h ∈ IN , a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) −→ ZZ h − {0} such that the induced vertex set labeling l : V (G) −→ ZZ h defined by l(v) = ∑ uv∈E(G) l(uv) is a constant map. For a given graph G, the set of all h ∈ ZZ + for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). The concept of integer-magic spectrum of ...